A Zero-Dimensional Gröbner Basis for AES-128
نویسندگان
چکیده
We demonstrate an efficient method for computing a Gröbner basis of a zero-dimensional ideal describing the key-recovery problem from a single plaintext/ciphertext pair for the full AES-128. This Gröbner basis is relative to a degree-lexicographical order. We investigate whether the existence of this Gröbner basis has any security implications for the AES.
منابع مشابه
Algebraic methods in block cipher cryptanalysis
This thesis is a contribution to the field of algebraic cryptanalysis. Specifically the following topics have been studied: • We construct and analyze Feistel and SLN ciphers that have a sound design strategy against linear and differential cryptanalysis. The encryption process for these cipher can be described by very simple polynomial equations. For a block and key size of 128 bits, we presen...
متن کاملAlgebraic cryptanalysis of block ciphers using Groebner bases
This thesis investigates the application of Gröbner bases to cryptanalysis of block ciphers. The basic for the application is an algorithm for solving systems of polynomial equations via Gröbner basis computation. In our case, polynomial equations describe the key recovery problem for block ciphers, i.e., the solution of these systems corresponds to the value of the secret key. First we demonst...
متن کاملOn Gröbner Basis Detection for Zero-dimensional Ideals
The Gröbner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if “yes” finda term order such that the set of polynomials is a Gröbner basis. This problem was shown to be NP-hard by Sturmfels and Wiegelmann. We show that GBD when studied in the context of zero dimensional ideals is also NP-hard. An algorithm to solve GBD for zero dimensiona...
متن کاملOn Border Basis and Gröbner Basis Schemes
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing zero-dimensional ideals when the coefficients are inexact. And in this situation they show a clear advantage with respect to Gröbner bases which, neverthele...
متن کاملFormal verification of integer multipliers by combining Gröbner basis with logic reduction
Formal verification utilizing symbolic computer algebra has demonstrated the ability to formally verify large Galois field arithmetic circuits and basic architectures of integer arithmetic circuits. The technique models the circuit as Gröbner basis polynomials and reduces the polynomial equation of the circuit specification wrt. the polynomials model. However, during the Gröbner basis reduction...
متن کامل